\hypertarget{_exercise__2__1__2_8h}{
\section{/home/marc/SVN/IntroToAlgo/Chapter2/Exercise\_\-2\_\-1\_\-2.h File Reference}
\label{_exercise__2__1__2_8h}\index{/home/marc/SVN/IntroToAlgo/Chapter2/Exercise\_\-2\_\-1\_\-2.h@{/home/marc/SVN/IntroToAlgo/Chapter2/Exercise\_\-2\_\-1\_\-2.h}}
}
{\ttfamily \#include \char`\"{}../Exercise.h\char`\"{}}\par
\subsection*{Classes}
\begin{DoxyCompactItemize}
\item 
class \hyperlink{class_exercise__2__1__2}{Exercise\_\-2\_\-1\_\-2}
\begin{DoxyCompactList}\small\item\em \hyperlink{class_exercise}{Exercise} 2.1-\/2 First, we implement the insertion sort algorithm as desribed in the chapter (non-\/decreasing order), and then we implement it like asked in the exercise (non-\/increasing). \end{DoxyCompactList}\end{DoxyCompactItemize}
